Hierarchies of monadic generalized quanti
نویسنده
چکیده
A combinatorial criterium is given when a monadic quantiier is expressible by means of universe-independent monadic quantiiers of width n. It is proved that the corresponding hierarchy does not collapse. As an application, it is shown that the second resumption (or vectorization) of the HH artig quantiier is not deenable by monadic quantiiers. The techniques rely on Ramsey theory.
منابع مشابه
Tree-width and the monadic quantifier hierarchy
It is well known that on classes of graphs of bounded tree-width, every monadic second-order property is decidable in polynomial time. The converse is not true without further assumptions. It follows from the work of Robertson and Seymour, that if a class of graphs K has unbounded tree-width and is closed under minors, then K contains all planar graphs. But on planar graphs, three-colorability ...
متن کاملOn the Expressive Power of Modal Logics on Trees
Various logical languages are compared regarding their expressive power with respect to models consisting of nitely bounded branching in nite trees The basic multimodal logic with backward and forward necessity operators is equivalent to restricted rst order logic by adding the binary temporal operators since and until we get the expressive power of rst order logic on trees Hence restricted pro...
متن کاملThe Monadic Quanti
The monadic second-order quantiier alternation hierarchy over the class of nite graphs is shown to be strict. The proof is based on automata theoretic ideas and starts from a restricted class of graph-like structures, namely nite two-dimensional grids. Considering grids where the width is a function of the height, we prove that the diierence between the levels k +1 and k of the monadic hierarch...
متن کاملModal Quanti cation over Structured Domains
1 Quantiiers as Modal Operators 1.1 Motivations The semantics for quantiiers described in this paper can be viewed both as a new semantics for generalized quantiiers and as a new look at standard rst-order quantiication, bringing the latter closer to modal logic. The standard semantics for generalized quantiiers interprets a monadic generalized quantiier Q as a set of subsets of a domain. For e...
متن کاملGeneralized Quanti ers
We considered the problem of processing queries that contain generalized quanti ers. We demonstrate that current relational systems are ill-equipped, both at the language and at the query processing level, to deal with such queries. We propose a boolean matrix approach which establishes the feasibility of building systems that can process queries with generalized quanti ers e ciently, and we pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007